A tame sequence of transitive Boolean functions
نویسندگان
چکیده
منابع مشابه
Boolean functions with a vertex-transitive group of automorphisms
A Boolean function is called vertex-transitive, if the partition of the Boolean cube into the preimage of 0 and the preimage of 1 is invariant under a vertex-transitive group of isometric transformations of the Boolean cube. The logarithm of the number of the vertex-transitive functions of n variables is at least Ω(n) and at most O(n logn). There is a polynomial over F2 of any given degree, whi...
متن کاملTame functions are semismooth
Superlinear convergence of the Newton method for nonsmooth equations requires a “semismoothness” assumption. In this work we prove that locally Lipschitz functions definable in an o-minimal structure (in particular semialgebraic or globally subanalytic functions) are semismooth. Semialgebraic, or more generally, globally subanalytic mappings present the special interest of being γ -order semism...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Approximating the Transitive Closure of a Boolean Affine Relation
Boolean affine relations, which combine affine inequalities by boolean connectives are ubiquitous in all kind of static program analyzes. One of the crucial operations on such relations is transitive closure, which is closely related to the construction of loop inductive invariants. I present here a new over-approximation algorithm, which has the interesting property of being extendible for inc...
متن کاملBoolean Functions
Written by prominent experts in the field, this monograph provides the first comprehensive and unified presentation of the structural, algorithmic, and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. It presentswithin this framework the fundamental elements...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2020
ISSN: 1083-589X
DOI: 10.1214/20-ecp366